On linear recursive sequences with coefficients in arithmetic-geometric progressions
نویسندگان
چکیده
منابع مشابه
Nonrepetitive Sequences on Arithmetic Progressions
A sequence S = s1s2 . . . sn is nonrepetitive if no two adjacent blocks of S are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization of nonrepetitive sequences involving arithmetic progressions. We prove that for every k > 1, there exist arbitrarily long sequences over at most 2k+10 √ k symbols whose s...
متن کاملOn sequences without geometric progressions
Several papers have investigated sequences which have no k-term arithmetic progressions, finding bounds on their density and looking at sequences generated by greedy algorithms. Rankin in 1960 suggested looking at sequences without k-term geometric progressions, and constructed such sequences for each k with positive density. In this paper we improve on Rankin’s results, derive upper bounds, an...
متن کاملArithmetic Progressions in Sequences with Bounded Gaps
Let G(k;r) denote the smallest positive integer g such that if 1 = a1;a2; : : : ;ag is a strictly increasing sequence of integers with bounded gaps a j+1 a j r, 1 j g 1, then fa1;a2; : : : ;agg contains a k-term arithmetic progression. It is shown that G(k;2) > q k 1 2 4 3 k 1 2 , G(k;3) > 2 k 2 ek (1+ o(1)), G(k;2r 1)> r k 2 ek (1+o(1)), r 2. For positive integers k, r, the van der Waerden num...
متن کاملAlgebraic Polynomials with Random Coefficients with Binomial and Geometric Progressions
The expected number of real zeros of an algebraic polynomial ao a1x a2x · · · anx with random coefficient aj , j 0, 1, 2, . . . , n is known. The distribution of the coefficients is often assumed to be identical albeit allowed to have different classes of distributions. For the nonidentical case, there has been much interest where the variance of the jth coefficient is var aj ( n j ) . It is sh...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Sciences
سال: 2015
ISSN: 1314-7552
DOI: 10.12988/ams.2015.5163